A volume first maxima-finding algorithm
نویسندگان
چکیده
The maxima-finding is a fundamental problem in computational geometry with many applications. In this paper, a volume first maxima-finding algorithm is proposed. It is proved that the expected running time of the algorithm is N + o(N) when choosing points from CI distribution, which is a new theoretical result when the points belong to d(>2) dimensional space. Experimental results and theoretical analysis indicate that the algorithm runs faster than the Move-To-Front maxima-finding algorithm. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
Finding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملFirst Order Phase Transition in the 3 - dimensional Blume - Capel Model on a Cellular
The first order phase transition of the three-dimensional Blume Capel are investigated using cooling algorithm which improved from Creutz Cellular Automaton for the D/J = 2.9 parameter value in the first order phase transition region. The analysis of the data using the finite-size effect and the histogram technique indicate that the magnetic susceptibility maxima and the specific heat maxima in...
متن کاملEfficient maxima-finding algorithms for random planar samples
We collect major known algorithms in the literature for finding the maxima of multi-dimensional points and provide a simple classification. Several new algorithms are proposed. In particular, we give a new maxima-finding algorithm with expected complexity n + O( √ n logn) when the input is a sequence of points uniformly chosen at random from general planar regions. We also give a sequential alg...
متن کاملImtxovinrr Search Through
Adding diversity to symbolic search techniques has not been explored in artificial intelligence. Adding a diversity criterion provides us with a powerful new mechanism for finding global maxima in complex search spaces and helps to alleviate the problem of premature convergence to local maxima. A theoretical analysis is presented of issues in diversity searching which previously haven’t been ad...
متن کاملMode Directed Path Finding
Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts, have been a dominating force in the area of multi-relational concept learning. However, hill-climbing heuristics are susceptible to local maxima and plateaus. In this paper, we sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011